Arithmetic of elliptic curves through the ages
نویسنده
چکیده
This expository article is based on a talk that was given at the EWM Symposium held at Cambridge, U.K., in October 2007. The talk was aimed at a broad and general audience and I have tried to retain the flavour of the original lecture while converting it to its present text version. I have also attempted to make the bibliography as comprehensive as possible, but given the vastness of the subject, apologise for any inadvertent omissions. I would like to thank the organisers of the EWM conference for the invitation to speak, and John Coates for helpful discussions and comments. It is a pleasure to thank Chennai Mathematical Institute for hospitality accorded both at the time of preparing the talk, and later, while writing the article.
منابع مشابه
Arithmetic progressions on Huff curves
We look at arithmetic progressions on elliptic curves known as Huff curves. By an arithmetic progression on an elliptic curve, we mean that either the x or y-coordinates of a sequence of rational points on the curve form an arithmetic progression. Previous work has found arithmetic progressions on Weierstrass curves, quartic curves, Edwards curves, and genus 2 curves. We find an infinite number...
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملOn the rank of certain parametrized elliptic curves
In this paper the family of elliptic curves over Q given by the equation Ep :Y2 = (X - p)3 + X3 + (X + p)3 where p is a prime number, is studied. Itis shown that the maximal rank of the elliptic curves is at most 3 and someconditions under which we have rank(Ep(Q)) = 0 or rank(Ep(Q)) = 1 orrank(Ep(Q))≥2 are given.
متن کاملOn the Elliptic Curves of the Form $y^2 = x^3 − pqx$
By the Mordell- Weil theorem, the group of rational points on an elliptic curve over a number field is a finitely generated abelian group. This paper studies the rank of the family Epq:y2=x3-pqx of elliptic curves, where p and q are distinct primes. We give infinite families of elliptic curves of the form y2=x3-pqx with rank two, three and four, assuming a conjecture of Schinzel ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009